A Game Semantics Foundation for Logic Programming

We introduce a semantics of Logic Programming based on classical Game Theory, which is proven to be sound and complete w.r.t. traditional semantics like the minimum Herbrand model and the s-semantics. This AND compositional game semantics allows a very simple characterization of the solution set of a logic program in term of approximations of the value of the game associated to it, which can also be used to capture in a very simple way the traditional “negation as failure” extensions. This novel approach to semantics opens the way to a better understanding of the mechanisms at work in parallel implementations of logic programs, and is of great pedagogical value.